Перевод: с английского на русский

с русского на английский

deterministic decision

См. также в других словарях:

  • Decision tree model — In computational complexity and communication complexity theories the decision tree model is the model of computation or communication in which an algorithm or communication process is considered to be basically a decision tree, i.e., a sequence… …   Wikipedia

  • Decision rule — This article is about decision theory. For the use in computer science, see decision rules. In decision theory, a decision rule is a function which maps an observation to an appropriate action. Decision rules play an important role in the theory… …   Wikipedia

  • Decision field theory — (DFT), is a dynamic cognitive approach to human decision making. It is a cognitive model that describes how people make decisions rather than a rational model that prescribes what people should do. It is also a dynamic model of decision making… …   Wikipedia

  • Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… …   Wikipedia

  • Decision making — For Decision making in groups, see Group decision making. Sample flowchart representing the decision process to add a new article to Wikipedia. Decision making can be regarded as the mental processes (cognitive process) resulting in the selection …   Wikipedia

  • Two-way deterministic finite automaton — In computer science, a two way deterministic finite automaton (2DFA) is an abstract machine, a generalized version of the deterministic finite automaton (DFA) which can revisit characters already processed. As in a DFA, there are a finite number… …   Wikipedia

  • Regret (decision theory) — Regret (often also called opportunity loss) is defined as the difference between the actual payoff and the payoff that would have been obtained if a different course of action had been chosen. This is also called difference regret. Furthermore,… …   Wikipedia

  • Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …   Wikipedia

  • Applications of randomness — Randomness has many uses in gambling, divination, statistics, cryptography, art, etc.Note that these uses may have different requirements when it comes to statistical randomness or unpredictability, which in turn leads to different randomization… …   Wikipedia

  • Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …   Wikipedia

  • NP (complexity) — Diagram of complexity classes provided that P ≠ NP. The existence of problems outside both P and NP complete in this case was established by Ladner.[1] In computational complexity theory, NP is one of the most fundamental complexity classes. The… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»